-
1 infeasible solution
Математика: невозможное решение, недопустимое решение -
2 infeasible solution
мат.недопустимое решение; невозможное решение -
3 solution
1) раствор2) растворение3) мат. решение- completely unstable solution - neutrally stable solution - particular solution - pure strategy solution - solution of equation - uniformly stable solutionsolution by inspection — решение подбором, решение проверкой
-
4 невозможное решение
Большой англо-русский и русско-английский словарь > невозможное решение
-
5 недопустимое решение
Большой англо-русский и русско-английский словарь > недопустимое решение
-
6 point
1) точка2) балл, очко3) деление (шкалы); румб; лимб4) заострение, остриё, острый конец || заострять, затачивать5) полигр. пункт ( единица измерения в типографской системе мер)6) пост, пункт, место7) мыс8) наконечник9) предмет11) указывать•about a point — мат. в окрестности точки
point at infinity — мат. несобственный элемент, бесконечно удалённая точка
point covers a line — т. граф. вершина покрывает ребро
point in infinity — мат. точка в бесконечности
winding number of curve with respect to point — мат. порядок кривой относительно точки (число оборотов вектора, соединяющего данную точку с точкой кривой при обходе кривой)
right two points — мор. на два румба вправо
with a point as a center — мат. с центром в точке…
- bisecting point of a segment - conditionally stable point - division point - essentially singular point - general point - generic point - horizontal control point - infinitely remote point point - material point - minimal fixed point - negatively stable point - nonessential singular point - optimum point - piercing point of a line - point of greatest concentration - positively normal point - positively stable point - right singular point - single mass point - strongly recurrent point - strongly singular point - triply rational point - uniplanar double point - unstable nodal point - upper significance pointwith respect to point — мат. относительно точки
-
7 region
1) зона2) область3) полоса4) район5) регион6) сфера7) участок•- region of admissible deviations - region of asymptotical stability - region of determination - stable region
См. также в других словарях:
Corner solution — A corner solution is a special solution to an agent s maximization problem in which the quantity of one of the arguments in the maximized function is zero. The more usual solution will lie in the non zero interior at the point of tangency between … Wikipedia
corner solution — noun A solution to a minimization or maximization problem where an interior solution is infeasible … Wiktionary
Multi-criteria decision analysis — Multiple criteria decision making or multiple criteria decision analysis is a sub discipline of operations research that explicitly considers multiple criteria in decision making environments. Whether in our daily lives or in professional… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction … Universalium
Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
